2006 and 2007 Max-SAT Evaluations: Contributed Instances
نویسندگان
چکیده
In this technical report we briefly describe the instances submitted to the 2006 and 2007 Max-SAT Evaluations. First, we introduce the instances that can be directly encoded as Max-SAT. Then, we describe the methods used to translate problem instances coming from other optimization frameworks to Max-SAT. Finally, we present a quick reference table containing short descriptions of each set of problem instances.
منابع مشابه
Guest Editors Conclusion
This special issue comprises six papers devoted to SAT solving and three papers devoted to MAXSAT solving. With two exception, the papers contain detailed information about some of the best solvers from the 5th SAT solver competition and from the 2nd MAX-SAT solver competition, which took place as side event of the 10th International Conference on Theory and Applications of Satisfiability Testi...
متن کاملThe First and Second Max-SAT Evaluations
We describe the organization and report on the results of the First and Second Max-SAT Evaluations, which were organized as affiliated events of the 2006 and 2007 editions of the International Conference on Theory and Applications of Satisfiability Testing (SAT-2006 and SAT-2007), discuss the insights gained and point out new directions for forthcoming evaluations. The main objectives of both e...
متن کاملNew Inference Rules for Max-SAT
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simplified formula that preserves satisfiability but, unfortunately, solving the Max-SAT problem for the simplified formula is not equivalent to solving it for the original formula. In this paper, we define a number of origina...
متن کاملExploiting Inference Rules to Compute Lower Bounds for MAX-SAT Solving
In this paper we present a general logical framework for (weighted)MAX-SAT problem, and study properties of inference rules for branch and bound MAX-SAT solver. Several rules, which are not equivalent but Λ-equivalent, are proposed, and we show that Λ-equivalent rules are also sound. As an example, we show how to exploit inference rules to achieve a new lower bound function for a MAX2-SAT solve...
متن کاملExact Max 2-Sat: Easier and Faster
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, counting) weighted Max 2-Sat instances. One of them has a good performance if the underlying constraint graph has a small separator decomposition, another has a slightly improved worst case performance. For a 2-Sat inst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JSAT
دوره 4 شماره
صفحات -
تاریخ انتشار 2008